Priority Auctions and Queue Disciplines That Depend on Processing Time
نویسندگان
چکیده
We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that differ in the definition of bids (these may reflect either total payments or payments per unit of time) and in the timing of payments (before, or after service). In both schemes, a customer obtains priority over all customers, waiting in the queue or arriving while he is waiting, who make lower bids. Our main results show how the convexity/concavity of the function expressing the costs of delay determines the queue-discipline (i.e., SPT, LPT) arising in a bidding equilibrium.
منابع مشابه
M/G/1 Priority Queues
We examine an M/G/1 queue with several queueing disciplines. After reviewing some background material in probability theory, we consider a first-come first-served queue. Next, we examine an absolute priority queue, where high priority customers are always selected for service over lower priority customers, regardless of how long the latter have been waiting. We also review a method for calculat...
متن کاملOn mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between thes...
متن کاملOn Completeness and Equivalence of Some Dynamic Priority Schemes
This paper identifies various parametrized dynamic priority queue disciplines from literature which are complete in two class M/G/1 queue. Equivalence between these queue disciplines is established by obtaining non linear transformation in closed form. Motivation behind these completeness and equivalence results is discussed from optimal control perspective. Some comments on global FCFS policy ...
متن کاملA new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملNorwegian Priority Setting in Practice – an Analysis of Waiting Time Patterns Across Medical Disciplines
Background Different strategies for addressing the challenge of prioritizing elective patients efficiently and fairly have been introduced in Norway. In the time period studied, there were three possible outcomes for elective patients that had been through the process of priority setting: (i) high priority with assigned individual maximum waiting time; (ii) low priority without a maximum waitin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Management Science
دوره 51 شماره
صفحات -
تاریخ انتشار 2005